On the Convergence of Log-Likelihood Values in Iterative Decoding
نویسندگان
چکیده
A new method for visualizing the behavior of an iterative decoder is presented. This method is applied to regular and irregular low-density parity-check codes. Several types of decoding errors are investigated and suggestions are made for improving the iterative decoder to avoid such errors. Furthermore, structural properties of parity-check matrices that influence the decoding performance are identified.
منابع مشابه
A Low-Complexity Stopping Criterion for Iterative Turbo Decoding
This letter proposes an efficient and simple stopping criterion for turbo decoding, which is derived by observing the behavior of log-likelihood ratio (LLR) values. Based on the behavior, the proposed criterion counts the number of absolute LLR values less than a threshold and the number of hard decision 1’s in order to complete the iterative decoding procedure. Simulation results show that the...
متن کاملEffect of geometric models on convergence rate in iterative PET image reconstructions
Iterative PET image reconstructions can improve quantitation accuracy by explicitly modeling photon-limited nature and physical effects of coincident photons. Geometric model in iterative reconstructions defines the mapping between image and sinogram domains based on scanners geometry, which affects the accuracy of image results and the convergence rate of reconstruction algorithms. This paper ...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملLeast reliable messages based early termination method for LT soft decoder
In this paper, we propose a new early termination method (ETM) for Luby transform (LT) belief propagation (BP) decoder. The proposed ETM, which we call least reliable messages (LRM), observes only sign alterations of a small cluster in log-likelihood ratio (LLR) messages passing between nodes in BP decoder. Simulation results and complexity analyzes show that LRM significantly lower computation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002